Multipartite Quantum Secret Sharing Using Not-So-Weak Qubits
نویسندگان
چکیده
منابع مشابه
Multipartite Quantum Secret Sharing using a Single Not-So-Weak Qubit
We propose a new quantum secret sharing scheme using a single non-entangled qubit. In the scheme, by transmitting a qubit to the next party sequentially, a sender can securely transmit a secret message to N receivers who could only decode the message cooperatively after randomly shuffling the polarization of the qubit. We explain this quantum secret sharing scheme into the one between a sender ...
متن کاملQuantum secret sharing for a multipartite system under energy dissipation
We propose a protocol for multipartite secret sharing of quantum information through an amplitude damping quantum channel. This network is, for example, of two organizations communicating with their own employees connected via classical channels locally. We consider a GHZ state distributed among four members in an asymmetric fashion where the members of a sub-party collaborate to decode the rec...
متن کاملMultipartite Secret Sharing Based on CRT
Secure communication has become more and more important for system security. Since avoiding the use of encryption one by one can introduce less computation complexity, secret sharing scheme (SSS) has been used to design many security protocols. In SSSs, several authors have studied multipartite access structures, in which the set of participants is divided into several parts and all participant...
متن کاملSecret sharing schemes for Multipartite access structures
Information security has become much more important since electronic communication is started to be used in our daily life. The content of the term information security varies according to the type and the requirements of the area. Secret sharing schemes are introduced to solve the problems for securing sensitive information. In this paper, we review our proposed hierarchical and compartmented ...
متن کاملOn weak odd domination and graph-based quantum secret sharing
A weak odd dominated (WOD) set in a graph is a subset B of vertices such that ∃D ⊆ V \B, ∀v ∈ B, |N(v)∩D| = 1 mod 2. We point out the connections of weak odd domination with odd domination, (σ, ρ)-domination, and perfect codes. We introduce bounds on κ(G), the maximum size of WOD sets of a graph G, and on κ(G), the minimum size of non WOD sets of G. Moreover, we prove that the corresponding dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Physical Society
سال: 2007
ISSN: 0374-4884
DOI: 10.3938/jkps.51.4